Location:
Search - chess horse
Search list
Description: 在西洋棋中的武士与象棋中的马相似，走的都是L形的路，本程序以一个非递归的程序，输入一个表示棋盘的大小值n，在输入一个起点的坐标，找出一条从第一格起可以让武士棋走完n2格而不重复的路径。-In chess and chess in the samurai s horse is similar to walking are L-shaped path, the procedure to a non-recursive procedures, enter a value that the size of the chessboard of n, in the input the coordinates of a starting point to identify a starting from the first grid allows grid n2 samurai chess through the path without duplication.
Platform: |
Size: 2048 |
Author: V |
Hits:
Description: 一个小程序，是模拟一只马走遍国际象棋棋盘的过程，挺好玩的-A small program is a simulation of horse around the course of a chess board, very good fun
Platform: |
Size: 7168 |
Author: andrea |
Hits:
Description: 8×8的棋盘上分布着n个骑士，他们想约在某一格中聚会。骑士每天可以像国际象棋中的马那样移动一次，如图所示，可以从中间向8个方向移动，请你计算n个骑士的最早聚会地点和要走多少天。要求尽早聚会，且n个人走的总步数最少，先到聚会地点的骑士可以不再移动等待其他骑士。 -8 × 8 chessboard on distributed n-Cavalier, they want to about gathering in a cell. Cavalier day like chess in the horse as a mobile, as shown from the middle of moving to 8, please calculate the first n-Cavalier gathering place and the number of days to go. Meeting the requirements as soon as possible, and the total n of individuals taking steps at least, the first meeting place Cavalier can no longer wait for the other mobile Cavalier.
Platform: |
Size: 1024 |
Author: 王岳 |
Hits:
Description: 马踏棋盘问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2． 基本要求将马随机放在国际象棋8*8棋盘的某个方格中，马按走棋规则进行移动。编制非递归程序，求出马的行走路线，-Horse riding problem described in the design of a chessboard chess chessboard horse traveled demo program. 2. The basic requirements will be placed randomly MA 8* 8 chess board in a grid, Ma moves in accordance with the rules of the mobile. The preparation of non-recursive procedures, and run routes,
Platform: |
Size: 1024 |
Author: dongchao |
Hits:
Description: 设计一个国际象棋的马踏棋盘的演示程序。以一二维数组Board[8][8]表示国际象棋棋盘，以用户输入任一位置作为马的起始位置，设为(i,j)，其中0≤i，j≤7，马按照走棋的规则在棋盘范围内进行移动。本程序只求出一种遍历路径，用非递归程序实现吗的行走路线。-To design a chess board horse riding demo program. A two-dimensional array Board [8] [8] that the chess board to the user to enter any one location as the initial location of the horse, set (i, j), in which 0 ≤ i, j ≤ 7, in accordance with the following horse the rules of chess board mobile framework. This procedure only a traversal path, the use of non-recursive process routes to achieve it.
Platform: |
Size: 9216 |
Author: chissie |
Hits:
Description: 图算法之骑士遍历问题，骑士遍历问题，或者象棋中马的遍历问题-Knight traversal, or chess problem in ergodic horse
Platform: |
Size: 1024 |
Author: li shu |
Hits:
Description: 国际象棋中马踏棋盘历遍棋盘的走法，各个位置均可以实现。-Chess board calendar of horse riding all over the board walk method can be achieved in various locations.
Platform: |
Size: 1024 |
Author: 杨正 |
Hits:
Description: 马踏棋盘的C语言代码。将马随机放在国际象棋的8X8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2,。。。，64依次填入一个8X8的方阵，输出之。-Horse riding board the C language code. Ma randomly on the 8X8 chess board Board [8] [8] of a box, the horse moves in accordance with the rules of the mobile. Requires each box to enter only once, all around the chessboard of 64 squares. The preparation of non-recursive procedures, and run routes, and routes are obtained, the number 1,2,. . . , 64 followed by fill a 8X8 square, the output of.
Platform: |
Size: 2048 |
Author: de |
Hits:
Description: 将马随机放在国际象棋的8×8棋盘Board[0～7][0～7]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2，…，64依次填入一个8×8的方阵，输出之
-Ma Random Chess on the 8 × 8 chessboard Board [0 ~ 7] [0 ~ 7] of a box, the horse moves in accordance with the rules of the mobile. Requires each box to enter only once, all around the chessboard of 64 squares. The preparation of non-recursive procedures, and run routes, and routes are obtained, the number 1,2, ..., 64 followed by an 8 × 8 filled the square, the output of
Platform: |
Size: 3072 |
Author: 刘洋河 |
Hits:
Description: 国际棋盘上马的周游问题，该问题描述了国际象棋棋盘上的一只马，恰好走过除起点外的其它位置各一次，最后回到起点。这条路线称为一条马的Hamilton 周游路线-Launched an international board of the travel issue that describes the chess board on a horse, just walked outside the other locations except the starting point of all time, finally returned to the starting point. This line is called a horse' s Hamilton tour route
Platform: |
Size: 58368 |
Author: 于爱华 |
Hits:
Description: 本程序解决了关于国际象棋中马的周游路线问题，根据给出的初始点可以求出满足条件的所有路径。-This procedure resolved on chess in the horse traveled route, under the given conditions, the initial points can be derived to satisfy all the paths.
Platform: |
Size: 533504 |
Author: 荣峰华 |
Hits:
Description: 中国象棋马的棋盘遍历程序，对任意位置上放置的一个马，均能选择一个合适的路线，使得该棋子能按象棋的规划不重复地走过棋盘上的每一个位置-Chinese Chess board horse traversal procedures, placed anywhere on a horse, able to choose a suitable route, making the chess pieces can be according to the planning board did not repeatedly traversed a position on every
Platform: |
Size: 2048 |
Author: maya |
Hits:
Description: 跳马的回溯算法（8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它63 个位置各一次，最后回 到起点。这条路线称为一条马的Hamilton 周游路线。对于给定的m*n 的国际象棋棋盘，m和n均为大于5 的偶数，且|m-n|≤2，该算法找出一条马的Hamilton周游路线。--Vault of the backtracking algorithm (8* 8 chess board on a horse, just walk outside except from the other 63 locations each time, finally returned to the starting point. This line is called a horse' s Hamilton traveled routes. For the a given m* n chess board, m and n are greater than 5, even, and | mn | ≤ 2, the algorithm is to find a horse' s Hamilton traveled routes.--
Platform: |
Size: 3072 |
Author: cheneiz |
Hits:
Description: 用数据结构(C语言版)编写程序，实现一个国际象棋的马踏遍棋盘的演示程序。具体要求为：将马随机放在国际象棋的8*8棋盘的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。用堆栈编制非递归程序求出马的行走路线，并按求出的行走路线，将数字1,2,3,……,64依次填入一个8*8的方阵，输出之。 -With the data structure (C language version) to write programs to achieve a chess board horse travels to the demonstration program. Specific requirements are: the horses were randomly placed in the 8* 8 chess board in a box, Ma according to the rules of chess to go mobile. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedure with the stack order to run for walking routes, and then find the routes will be the number 1,2,3, ... ..., 64 in turn fill in an 8* 8 matrix, the output of.
Platform: |
Size: 4096 |
Author: 周敏从 |
Hits:
Description: 设计一个国际象棋的马踏遍棋盘的演示程序。
将马随机放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则（见题集p98）进行移动。要求每个方格只进入一次，走边棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,3,…,64依次填入一个8×8的方阵，输出之。
-To design a chess board horse travels to the demonstration program. The horses were randomly placed in 8 × 8 chess board Board [8] [8] in a box, horse by walking chess rules (see the title set p98) to move it. Requires that each box is only entered once, take the side of all the 64 squares on a chessboard. The preparation of non-recursive procedures, seeking to run for walking routes, and then find the routes will be the number 1,2,3, ..., 64 in turn fill in an 8 × 8 of the square, the output of.
Platform: |
Size: 10240 |
Author: sunyu |
Hits:
Description: 象棋马的哈密顿回路算法代码，分治递归的方法。当m n<24时结果正确。这是重新上传，上一次工程中疏漏没有包含源码。-Hamilton horse chess circuit algorithm code, recursive partition method. When mn < 24 hours was correct. This is a re-upload, the last project oversight does not include source code.
Platform: |
Size: 3694592 |
Author: 王丽玮 |
Hits:
Description: 8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回
到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m
和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。
编程任务：
对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton
周游路线。
Input
输入数据的第一行有2个正整数m和 n，表示给定的国际象棋棋盘
由 m行，每行n个格子组成。
Output
将计算出的马的Hamilton周游路线用下面的2 种表达方式输出。
第 1 种表达方式按照马步的次序给出马的 Hamilton 周游路线。马的每一步用所在的方
格坐标(x，y)来表示。x表示行的坐标，编号为 0，1，…，m-1；y表示列的坐标，编号为 0，
1，…，n-1。起始方格为（0，0）。
第 2 种表达方式在棋盘的方格中标明马到达该方格的步数。（0，0）方格为起跳步，并
标明为第1步。
-8* 8 chess board on a horse, just walk outside than from the other 63 positions each time, and finally back
To the starting point. This line is called Hamilton a horse travel routes. For a given m* n chess board, m
And n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes.
Programming tasks:
For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton
Travel routes.
Input
The first line of input data are two positive integers m and n, that a given chessboard
By the m lines of n-grid component.
Output
The calculated travel route horse Hamilton 2 with the following expression of the output.
The first one kind of expression is given in accordance with the order of the horse Horse Hamilton travel routes. Horse with each step of the square where
Grid coordinates (x, y) to represent. the coordinates of x that line, numbered 0,1, ..., m-1 y co
Platform: |
Size: 16384 |
Author: zhang |
Hits:
Description: 编写程序求解骑士巡游问题：在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。
当n=5时，意味着要在5行5列的棋盘的25个“点”处，按骑士行走规则，依次将1至25这25个“棋子”（数码）分别摆放到棋盘上（摆满25个位置则成功，否则失败问题无解）。例如，当n=5且初始坐标位置定为(1，1) — 即最左上角的那个点时，如下是一种巡游“路线图”。程序执行后的输出结果为：
(x1,y1)? => (1=>5, 1=>5) : 1 1
1 6 15 10 21
14 9 20 5 16
19 2 7 22 11
8 13 24 17 4
25 18 3 12 23-Knight Parade programming to solve the problem: in n rows n columns of the board (such as n = 5), assuming a knight (in chess in the "horse to go on" walking method) from the initial coordinates (x1, y1) starting , to be sung (Parade) board in the position of each of the first. Please compile a program to solve for the Knight Parade "road map" (or tell the knight, starting from a position when not visiting with the board- the problem no solution).
Platform: |
Size: 319488 |
Author: 廖 |
Hits:
Description: 8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回
到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m
和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。
编程任务：
对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton
周游路线。 -8* 8 chess board on a horse just walked outside than from the other 63 positions each time, and finally returned to the starting point. This line is called a horse' s Hamilton travel routes. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes. Programming task: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton travel routes.
Platform: |
Size: 4096 |
Author: ahangin |
Hits:
Description: 考虑8 x 8的国际象棋棋盘上某个位置的一匹马，它是否可能只走63步，正好走过除起点以外的其他63个位置各一次？如果有这样的一种走法，则称所走的这条路线为一匹马思维周游路线。试设计一个分治算法找出一条马的周游路线。-Consider 8 x 8 chess board on a horse to a location, it may only take 63 steps, just walk away than from the other 63 positions each time? If you have such a walk method, claimed by walking the route as a Ma Siwei travel routes. Divide and Conquer Algorithm to design a test to find a horse' s travel route.
Platform: |
Size: 1024 |
Author: ymeng |
Hits: